Notes on the 2n-conjecture∗

نویسنده

  • Bryan L. Shader
چکیده

A sign pattern is an n × n matrix, A, with entries in {+,−, 0}. If A is a real n× n matrix for which each entry has the same sign as its corresponding entry in A, then A is a realization of A, and we write A ∈ A. The 2n-conjecture is related to the study of the spectral properties among the matrices in A. The n × n sign pattern A is a spectrally arbitrary pattern (or a SAP, for short), provided that for each real, monic polynomial r(x) of degree n there is a realization A ∈ A whose characteristic polynomial pA(x) is r(x). Equivalently, A is a SAP provided each conjugate-closed multi-set of n complex numbers is the spectrum of at least one realization of A. As an example, consider the sign-pattern

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A proof of Sumner's universal tournament conjecture for large tournaments

Sumner’s universal tournament conjecture states that any tournament on 2n−2 vertices contains any directed tree on n vertices. In this paper we prove that this conjecture holds for all sufficiently large n. The proof makes extensive use of results and ideas from a recent paper by the same authors, in which an approximate version of the conjecture was

متن کامل

On a degree sequence analogue of Pósa's conjecture

A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [17]. We prove a degree sequence version of Pósa’s conjecture: Given any η > 0, every graph G of sufficiently large order n contains the square of a Hamilton...

متن کامل

On rainbow matchings in bipartite graphs

We present recent results regarding rainbow matchings in bipartite graphs. Using topological methods we address a known conjecture of Stein and show that if Kn,n is partitioned into n sets of size n, then a partial rainbow matching of size 2n/3 exists. We generalize a result of Cameron and Wanless and show that for any n matchings of size n in a bipartite graph with 2n vertices there exists a f...

متن کامل

Trees with three leaves are (n + l)-unavoidable

We prove that every tree of order n 5 with three leaves is (n + 1)-unavoidable. More precisely, we prove that every tree A with three leaves of order n is contained in every tournament T of order n + 1 except if (T ; A) is (R 5 ; S + 3) or its dual, where R 5 is the regular tournament on ve vertices and S + 3 is the outstar of degree three, that is, the tree consisting of a root dominating thre...

متن کامل

The homology of partitions with an even number of

Let e 2n denote the subposet obtained by selecting even ranks in the partition lattice 2n : We show that the homology of e 2n has dimension (2n)! 2 2n?1 E 2n?1 ; where E 2n?1 is the tangent number. It is thus an integral multiple of both the Genocchi number and an Andr e or simsun number. Using the general theory of rank-selected homology representations developed in Su], we show that, for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006